Exception Handling in Logic Programming

One of the long-standing problems on logic programming is to express exception handling in a high-level way. We argue that this problem can be solved by adopting computability logic and sequential-choice disjunctive goal formulas of the form G0 ▽ G1 where G0, G1 are goals. These goals have the following intended semantics: sequentially choose the first true goal Gi and execute Gi where i(= 0 or 1). These goals thus allow us to specify a task G0 with the failure-handling (exception handling) routine G1. key words: Prolog, exception handling, failure handling, computability logic